Categorical axiomatics of dynamic programming
نویسندگان
چکیده
منابع مشابه
A Categorical Axiomatics for Bisimulation
We give an axiomatic category theoretic account of bisimulation in process algebras based on the idea of functional bisimulations as open maps. We work with 2-monads, T , on Cat. Operations on processes, such as nondeterministic sum, prefixing and parallel composition are modelled using functors in the Kleisli category for the 2-monad T . We may define the notion of open map for any such 2-mona...
متن کاملCategorical Description of Dynamic Fuzzy Logic Programming Language
First, this paper gives the relative basic theory of dynamic fuzzy logic, and introduces the basic data types of dynamic fuzzy logic. Then we introduce the basic data types of dynamic fuzzy logic and the abstract syntax of dynamic fuzzy logic programming language. At last, this paper gives the categorical description of dynamic fuzzy logic programming language according to categorical theory, a...
متن کاملAxiomatics for Data Refinement in Call by Value Programming Languages
We give a systematic category theoretic axiomatics for modelling data re nement in call by value programming languages. Our leading examples of call by value languages are extensions of the computational -calculus, such as FPC and languages for modelling nondeterminism, and extensions of the rst order fragment of the computational -calculus, such as a CPS language. We give a category theoretic ...
متن کاملA categorical programming language
A theory of data types and a programming language based on category theory are presented. Data types play a crucial role in programming. They enable us to write programs easily and elegantly. Various programming languages have been developed, each of which may use different kinds of data types. Therefore, it becomes important to organize data types systematically so that we can understand the r...
متن کاملIn Proceedings of Concur '98, C a Categorical Axiomatics for Bisimulation
We give an axiomatic category theoretic account of bisimu-lation in process algebras based on the idea of functional bisimulations as open maps. We work with 2-monads, T , on Cat. Operations on processes , such as nondeterministic sum, preexing and parallel composition are modelled using functors in the Kleisli category for the 2-monad T. We may deene the notion of open map for any such 2-monad...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1975
ISSN: 0022-247X
DOI: 10.1016/0022-247x(75)90139-0